Binomial Andrews-gordon-bressoud Identities
نویسنده
چکیده
Binomial versions of the Andrews-Gordon-Bressoud identities are given.
منابع مشابه
LATTICE PATHS, q-MULTINOMIALS AND TWO VARIANTS OF THE ANDREWS-GORDON IDENTITIES
A few years ago Foda, Quano, Kirillov and Warnaar proposed and proved various finite analogs of the celebrated Andrews-Gordon identities. In this paper we use these polynomial identities along with the combinatorial techniques introduced in our recent paper to derive Garrett, Ismail, Stanton type formulas for two variants of the Andrews-Gordon identities. 1. Background and the first variant of ...
متن کاملOverpartitions, lattice paths, and Rogers-Ramanujan identities
Abstract. We extend partition-theoretic work of Andrews, Bressoud, and Burge to overpartitions, defining the notions of successive ranks, generalized Durfee squares, and generalized lattice paths, and then relating these to overpartitions defined by multiplicity conditions on the parts. This leads to many new partition and overpartition identities, and provides a unification of a number of well...
متن کاملParity in Partition Identities
This paper considers a variety of parity questions connected with classical partition identities of Euler, Rogers, Ramanujan and Gordon. We begin by restricting the partitions in the Rogers-Ramanujan-Gordon identities to those wherein even parts appear an even number of times. We then take up questions involving sequences of alternating parity in the parts of partitions. This latter study leads...
متن کاملLattice Paths and Rogers Identities
Recently we interpreted five q-series identities of Rogers combinatorially by using partitions with “n + t copies of n” of Agarwal and Andrews [1]. In this paper we use lattice paths of Agarwal and Bressoud [2] to provide new combinatorial interpretations of the same identities. This results in five new 3-way combinatorial identities.
متن کاملA Bijective Proof of the Alladi-Andrews-Gordon Partition Theorem
Based on the combinatorial proof of Schur’s partition theorem given by Bressoud, and the combinatorial proof of Alladi’s partition theorem given by Padmavathamma, Raghavendra and Chandrashekara, we obtain a bijective proof of a partition theorem of Alladi, Andrews and Gordon.
متن کامل